Combination of LabVIEW and Improved Ant Colony Algorithms for Optimization Path Design of Pneumatic Robot Manipulator
نویسنده
چکیده
This article presents an improved ant colony optimization (IACO) algorithm to calculate the shortest path for pneumatic robot manipulator. MATLAB Script node in LabVIEW was used to determine the optimum trajectories and sequent nodes of moving for robot system. The LabVIEW graphical development software was used to construct the graphical user interference (GUI) of the robot manipulator, monitoring program, and the human machine. The results show that the shortest path improved by about 0.44%, 1.05% and 3.92%, and the running time by about 79.5%, 81.8% and 84.42% for 40 nodes, 90 nodes and 140 nodes, respectively. It can be clearly inferred from this conclusion that t with the increased number of trajectory nodes, the shortest path lengths and the running time of IACO algorithms are gradually less than those of TACO algorithms Keywordsant colony optimization; robot manipulator;path planning.
منابع مشابه
Finding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملAn Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks
High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...
متن کاملOptimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance
Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...
متن کاملOptimization Planning based on Improved Ant Colony Algorithm for Robot
As the ant colony algorithm has the defects in robot optimization path planning such as that low convergence cause local optimum, an improved ant colony algorithm is proposed to apply to the planning of path finding for robot. This algorithm uses the search way of exhumation ant to realize the complementation of advantages and accelerate the convergence of algorithm. The experimental result sho...
متن کاملComparison and Application of Metaheuristic Population-Based Optimization Algorithms in Manufacturing Automation
The paper presents a comparison and application of metaheuristic population-based optimization algorithms to a flexible manufacturing automation scenario in a metacasting foundry. It presents a novel application and comparison of Bee Colony Algorithm (BCA) with variations of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) for object recognition problem in a robot material ha...
متن کامل